Lexicographical ordering by spectral moments of trees with a prescribed diameter
نویسندگان
چکیده
منابع مشابه
Lexicographical ordering by spectral moments of trees with a given bipartition
Lexicographic ordering by spectral moments ($S$-order) among all trees is discussed in this paper. For two given positive integers $p$ and $q$ with $pleqslant q$, we denote $mathscr{T}_n^{p, q}={T: T$ is a tree of order $n$ with a $(p, q)$-bipartition}. Furthermore, the last four trees, in the $S$-order, among $mathscr{T}_n^{p, q},(4leqslant pleqslant q)$ are characterized.
متن کاملlexicographical ordering by spectral moments of trees with a given bipartition
lexicographic ordering by spectral moments ($s$-order) among all trees is discussed in this paper. for two given positive integers $p$ and $q$ with $pleqslant q$, we denote $mathscr{t}_n^{p, q}={t: t$ is a tree of order $n$ with a $(p, q)$-bipartition}. furthermore, the last four trees, in the $s$-order, among $mathscr{t}_n^{p, q},(4leqslant pleqslant q)$ are characterized.
متن کاملIndices of Trees with a Prescribed Diameter
Let G = (V (G), E(G)) be a simple graph, and let A be its adjacency matrix. The characteristic polynomial det(xI −A) of A is called the characteristic polynomial of G, and is denoted by φ(G, x). The eigenvalues of A (i.e. the zeros φ(G, x)) are called the eigenvalues of G. The index of a graph G is the largest eigenvalue of G, denoted by ρ(G). It has been studied extensively in the literature [...
متن کاملSIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملOrdering trees by their Laplacian spectral radii
Denote by Tn the set of trees on n vertices. Zhang and Li [X.D. Zang, J.S. Li, The two largest eigenvalues of Laplacian matrices of trees (in Chinese), J. China Univ. Sci. Technol. 28 (1998) 513–518] and Guo [J.M. Guo, On the Laplacian spectral radius of a tree, Linear Algebra Appl. 368 (2003) 379–385] give the first four trees in Tn, ordered according to their Laplacian spectral radii. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2010
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.06.022